Enumerating Longest Increasing Subsequences and Patience Sorting Enumerating Longest Increasing Subsequences and Patience Sorting
نویسندگان
چکیده
In this paper we present three algorithms that solve three combinatorial optimization problems related to each other. One of them is the patience sorting game, invented as a practical method of sorting real decks of cards. The second problem is computing the longest monotone increasing subsequence of the given sequence of n positive integers in the range 1; : : : ; n. The third problem is to enumerate all the longest monotone increasing subsequences of the given permutation.
منابع مشابه
Enumerating longest increasing subsequences and patience sorting
In this paper we present three algorithms that solve three combinatorial optimization problems related to each other. One of them is the patience sorting game, invented as a practical method of sorting real decks of cards. The second problem is computing the longest monotone increasing subsequence of the given sequence of n positive integers in the range 1, . . . , n. The third problem is to en...
متن کاملLongest Increasing Subsequences: from Patience Sorting to the Baik-deift-johansson Theorem
We describe a simple one-person card game, patience sorting. Its analysis leads to a broad circle of ideas linking Young tableaux with the longest increasing subsequence of a random permutation via the Schensted correspondence. A recent highlight of this area is the work of Baik-Deift-Johansson which yields limiting probability laws via hard analysis of Toeplitz determinants.
متن کاملParallel Algorithms for Patience Sorting and Longest Increasing Subsequence
In this paper, we consider parallel algorithms for the patience sorting and the longest increasing subsequence. These two problems are related each other and are not known to be in the class NC or P -complete. We first propose two algorithms for the patience sorting of n distinct integers. The first algorithm runs in O(m(np + logn)) time using p processors on the EREW PRAM, where m is the numbe...
متن کاملLongest Increasing Subsequences : From PatienceSorting to the
We describe a simple one-person card game, patience sorting. Its analysis leads to a broad circle of ideas linking Young tableaux with the longest increasing subsequence of a random permutation via the Schensted correspondence. A recent highlight of this area is the work of Baik-Deift-Johansson which yields limiting probability laws via hard analysis of Toeplitz determinants.
متن کاملPartition into Heapable Sequences, Heap Tableaux and a Multiset Extension of Hammersley's Process
We investigate partitioning of integer sequences into heapable subsequences (previously defined and established by Mitzenmacher et al. [BHMZ11]). We show that an extension of patience sorting computes the decomposition into a minimal number of heapable subsequences (MHS). We connect this parameter to an interactive particle system, a multiset extension of Hammersley’s process, and investigate i...
متن کامل